Distributed Inference-Based Multi-Robot Exploration

نویسندگان

  • Andrew J. Smith
  • Geoffrey A. Hollinger
چکیده

This work proposes a technique for distributed multi-robot exploration that leverages novel map inference to increase the team’s cumulative exploration efficiency. The multirobot team uses a distributed algorithm to coordinate the exploration using both the inferred and observed portions of the map. Individual robots select exploration poses by accounting for expected information gain and travel costs. Robots resolve conflicts between exploration goals with local auctions of expected travel costs. The benefits of inference-informed exploration are demonstrated in both simulated explorations and hardware trials. The proposed technique is compared against frontierbased and information-based exploration approaches. These comparisons evaluate the performance of the three exploration methods with decaying communication and a varied number of agents. Including inference in the coordination leads to a 13.15% reduction in the cumulative exploration path length in the trials conducted.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Online Multi-robot Exploration via Distributed Sequential Greedy Assignment

This work addresses the problem of efficient online exploration and mapping using multi-robot teams via a distributed algorithm for planning for multi-robot exploration— distributed sequential greedy assignment (DSGA)—based on the sequential greedy assignment (SGA) algorithm. SGA permits bounds on suboptimality but requires all robots to plan in series. Rather than plan for robots sequentially ...

متن کامل

A Distributed Bidding Algorithm for Multi-robot Exploration with Safety Concerns

This paper proposes a totally distributed bidding model for a typical multi-robot application, the exploration of unknown environment. Based on this bidding model, the robot safety concept is introduced. Its impact on the behavior and the efficiency of a multi-robot team is investigated. The algorithm aims to maximize the exploration efficiency and reduce the risk of the exploration. We also in...

متن کامل

Autonomous Multi-Robot Exploration in Communication-Limited Environments

Teams of communicating robots are likely to be used for a wide range of applications in the near future, such as robotic search and rescue or robotic exploration of hostile and remote environments. In such scenarios, environments are likely to contain significant interference and multi-robot systems must be able to cope with loss of communication. We propose a novel multi-robot exploration appr...

متن کامل

Entropy Gradient-based Exploration with Cooperative Robots in 3-D Mapping Missions

Building cooperatively 3-D maps of unknown environments is one of the application fields of multi-robot systems. This article focuses on the exploration problem with multiple robots, starting upon a previously proposed successful distributed architecture. An entropy gradient-based algorithm is used to select exploration viewpoints in the frontier between explored and unexplored regions. The arc...

متن کامل

Incremental Distributed Robust Inference from Arbitrary Robot Poses via EM and Model Selection

—We present a novel approach for multi-robot distributed and incremental inference over variables of interest, such as robot trajectories, considering the initial relative poses between the robots and multi-robot data association are both unknown. Assuming robots share with each other informative observations, this inference problem is formulated within an Expectation-Maximization (EM) optimiza...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018